- computationally intractable
- obliczeniowo niewykonalny
English-Polish dictionary of Electronics and Computer Science. 2013.
computationally intractable
Look at other dictionaries:
Phi-hiding assumption — The Phi Hiding assumption or Φ Hiding assumption is an assumption about the difficulty of finding small factors of φ( m ) where m is a number whose factorization is unknown, and φ is Euler s totient function. The security of many modern… … Wikipedia
Markov network — A Markov network, or Markov random field, is a model of the (full) joint probability distribution of a set mathcal{X} of random variables having the Markov property. A Markov network is similar to a Bayesian network in its representation of… … Wikipedia
Partially observable Markov decision process — A Partially Observable Markov Decision Process (POMDP) is a generalization of a Markov Decision Process. A POMDP models an agent decision process in which it is assumed that the system dynamics are determined by an MDP, but the agent cannot… … Wikipedia
Markov random field — A Markov random field, Markov network or undirected graphical model is a set of variables having a Markov property described by an undirected graph. A Markov random field is similar to a Bayesian network in its representation of dependencies. It… … Wikipedia
Optimality theory — (frequently abbreviated OT) is a linguistic model proposing that the observed forms of language arise from the interaction between conflicting constraints. OT models grammars as systems that provide mappings from inputs to outputs; typically, the … Wikipedia
Hypercomputation — refers to various hypothetical methods for the computation of non Turing computable functions (see also supertask). The term was first introduced in 1999 by Jack Copeland and Diane Proudfoot [Copeland and Proudfoot,… … Wikipedia
Orders of magnitude (numbers) — The logarithmic scale can compactly represent the relationship among variously sized numbers. This list contains selected positive numbers in increasing order, including counts of things, dimensionless quantity and probabilities. Each number is… … Wikipedia
Ising model — The Ising model, named after the physicist Ernst Ising, is a mathematical model in statistical mechanics. It has since been used to model diverse phenomena in which bits of information, interacting in pairs, produce collectiveeffects.Definition… … Wikipedia
Backdoor (computing) — A backdoor in a computer system (or cryptosystem or algorithm) is a method of bypassing normal authentication, securing remote access to a computer, obtaining access to plaintext, and so on, while attempting to remain undetected. The backdoor may … Wikipedia
Neats vs. scruffies — Artificial intelligence portal Neat and scruffy are labels for two different types of artificial intelligence research. Neats consider that solutions should be elegant, clear and provably correct. Scruffies believe that intelligence is too… … Wikipedia
Traffic grooming — is the process of grouping many small telecommunications flows into larger units, which can be processed as single entities. For example, in a network using both time division multiplexing and wavelength division multiplexing, two flows which are … Wikipedia
